Testing Stereo Data – Not the Matching Algorithms

نویسندگان

  • Ralf Haeusler
  • Reinhard Klette
چکیده

Current research in stereo image analysis focuses on improving matching algorithms in terms of accuracy, computational costs, and robustness towards real-time applicability for complex image data and 3D scenes. Interestingly, performance testing takes place for a huge number of algorithms, but, typically, on very small sets of image data only. Even worse, there is little reasoning whether data as commonly applied is actually suitable to prove robustness or even correctness of a particular algorithm. We argue for the need of testing stereo algorithms on a much broader variety of image data then done so far by proposing a simple measure for putting image stereo data of different quality into relation to each other. Potential applications include purpose-directed decisions for the selection of image stereo data for testing the applicability of matching techniques under particular situations, or for realtime estimation of stereo performance (without any need for providing ground truth) in cases where techniques should be selected depending on the given situation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Rules for the Use of Theses

OF THESIS 3D RECONSTRUCTION FROM STEREO/RANGE IMAGES. 3D reconstruction from stereo/range image is one of the most fundamental and extensively researched topics in computer vision. Stereo research has recently experienced somewhat of a new era, as a result of publically available performance testing such as the Middlebury data set, which has allowed researchers to compare their algorithms again...

متن کامل

Shader-Based Stereo Matching with Local Algorithms

Modern graphic cards can perform extreme amounts of calculations. In addition, the problem within the field of computer vision is often that the algorithms are very time consuming. The objective of this thesis is to find solutions to the stereo matching problem, employing dense local two-frame stereo matching algorithms and hardware support within modern graphic cards. The performance of the im...

متن کامل

طراحی و توسعه یک روش تلفیقی تناظریابی ناحیه ای و عارضه مبنای جدید برای توجیه نسبی در فتوگرامتری برد کوتاه

By far, many stereo-matching techniques have been successfully proposed and applied in digital aerial photogrammetry. However, due to some problems such as large parallaxes, occlusions, geometric deformations, and repetitive patterns in convergent close range images, these methods may not be applicable to the same level of success as that of aerial imagery. In order to overcome these shortcomin...

متن کامل

Survey on Benchmarks for a GPU Based Multi Camera Stereo Matching Algorithm

Stereo matching algorithms and multi camera reconstruction algorithms are usually compared using benchmarks. These benchmarks compare the quality of the resulting depth map or reconstructed surface mesh. We describe the differences between several known stereo and multi-view stereo benchmarks and their various datasets. Also the modifications that are necessary to use our own GPU based multi ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010